package BinaryTree;

public class Test {

    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();
        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println();
//        System.out.println("结点的个数：");
//        System.out.println(binaryTree.size1(root));
//        System.out.println(binaryTree.size2(root));
//        System.out.println("叶子结点的个数：");
//        System.out.println(binaryTree.getLeafNodeCount(root));
//        System.out.println(binaryTree.getLeafNodeCount2(root));
//        System.out.println("第k层结点的个数");
//        System.out.println(binaryTree.getKLevelNodeCount(root, 3));
//        System.out.println("整颗树的高度（深度）");
//        System.out.println(binaryTree.getHeight(root));
//        System.out.println("查找");
//        BinaryTree.TreeNode ret = binaryTree.find(root,'E');
//        System.out.println(ret.val);
//        binaryTree.levelOrder(root);
//        System.out.println();
//        System.out.println(binaryTree.isCompleteTree(root));
        binaryTree.preOrderNor(root);
        System.out.println();
        binaryTree.inOrderNor(root);
        System.out.println();
        binaryTree.postOrderNor(root);
    }
}
